Forbidden subgraphs in connected graphs
نویسندگان
چکیده
منابع مشابه
Forbidden subgraphs in connected graphs
Given a set ξ = {H1,H2, · · ·} of connected non acyclic graphs, a ξ-free graph is one which does not contain any member of ξ as copy. Define the excess of a graph as the difference between its number of edges and its number of vertices. Let Ŵk,ξ be theexponential generating function (EGF for brief) of connected ξ-free graphs of excess equal to k (k ≥ 1). For each fixed ξ, a fundamental differen...
متن کاملHamiltonian Connected Graphs Involving Forbidden Subgraphs
We consider the pair of graphs S and T such that every 3-connected {S, T}-free graph is hamiltonian connected. Such pairs are called hamiltonian connected pairs. We show three new hamiltonian connected pairs. Combing our results and a result of Shepherd, we conclude that if {S, T} is a pair of graphs such that every 2-connected {S, T}-free graph is hamiltonian then every 3-connected {S, T}-free...
متن کاملHamiltonicity and forbidden subgraphs in 4-connected graphs
Let T be the line graph of the unique tree F on 8 vertices with degree sequence (3, 3, 3, 1, 1, 1, 1, 1), i.e. T is a chain of three triangles. We show that every 4-connected {T,K1,3}-free graph has a hamiltonian cycle.
متن کاملPairs of forbidden subgraphs and 2-connected supereulerian graphs
Let G be a 2-connected claw-free graph. We show that • if G is N1,1,4-free or N1,2,2-free or Z5-free or P8-free, respectively, then G has a spanning eulerian subgraph (i.e. a spanning connected even subgraph) or its closure is the line graph of a graph in a family of well-defined graphs, • if the minimum degree δ(G) ≥ 3 and G is N2,2,5-free or Z9-free, respectively, then G has a spanning euleri...
متن کاملForbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs
In this paper, we consider forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs. Let Zi be the graph obtaind from a triangle by attaching a path of length i to one of its vertices, and let Q∗ be the graph obtained from the Petersen graph by adding one pendant edge to each vertex. Lai et al. [J. Graph Theory 64 (2010), no. 1, 1-11] conjectured that every 3-connected {K1,3, Z9}-f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2003.11.024